0.07/0.13 % Problem : Vampire---4.8_7759 : TPTP v0.0.0. Released v0.0.0. 0.07/0.14 % Command : run_E %s %d THM 0.13/0.36 % Computer : n011.cluster.edu 0.13/0.36 % Model : x86_64 x86_64 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.36 % Memory : 8042.1875MB 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.36 % CPULimit : 1440 0.13/0.36 % WCLimit : 180 0.13/0.36 % DateTime : Mon Jul 3 12:58:09 EDT 2023 0.13/0.36 % CPUTime : 0.20/0.49 Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.eMXRPjAJz6/Vampire---4.8_7759 0.20/0.49 # Version: 3.1pre001-ho 0.20/0.51 # Preprocessing class: HSMSSMSSSSSNSSA. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting post_as_ho1 with 900s (5) cores 0.20/0.51 # Starting post_as_ho12 with 180s (1) cores 0.20/0.51 # Starting new_ho_3 with 180s (1) cores 0.20/0.51 # Starting ehoh_best2_full_lfho with 180s (1) cores 0.20/0.51 # post_as_ho12 with pid 8127 completed with status 0 0.20/0.51 # Result found by post_as_ho12 0.20/0.51 # Preprocessing class: HSMSSMSSSSSNSSA. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting post_as_ho1 with 900s (5) cores 0.20/0.51 # Starting post_as_ho12 with 180s (1) cores 0.20/0.51 # No SInE strategy applied 0.20/0.51 # Search class: HGHSS-FFSF21-MSSFFMBN 0.20/0.51 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.20/0.51 # Starting post_as_ho12 with 90s (1) cores 0.20/0.51 # post_as_ho12 with pid 8133 completed with status 0 0.20/0.51 # Result found by post_as_ho12 0.20/0.51 # Preprocessing class: HSMSSMSSSSSNSSA. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting post_as_ho1 with 900s (5) cores 0.20/0.51 # Starting post_as_ho12 with 180s (1) cores 0.20/0.51 # No SInE strategy applied 0.20/0.51 # Search class: HGHSS-FFSF21-MSSFFMBN 0.20/0.51 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.20/0.51 # Starting post_as_ho12 with 90s (1) cores 0.20/0.51 # Preprocessing time : 0.001 s 0.20/0.51 # Presaturation interreduction done 0.20/0.51 0.20/0.51 # Proof found! 0.20/0.51 # SZS status Theorem 0.20/0.51 # SZS output start CNFRefutation 0.20/0.51 thf(decl_22, type, cR: a > a). 0.20/0.51 thf(decl_23, type, cP: a > a > a). 0.20/0.51 thf(decl_24, type, cL: a > a). 0.20/0.51 thf(decl_25, type, cZ: a). 0.20/0.51 thf(decl_26, type, esk1_1: (a > $o) > a). 0.20/0.51 thf(decl_27, type, esk2_1: (a > $o) > a). 0.20/0.51 thf(decl_28, type, esk3_0: a). 0.20/0.51 thf(decl_29, type, esk4_1: (a > $o) > a). 0.20/0.51 thf(decl_30, type, esk5_1: (a > $o) > a). 0.20/0.51 thf(cPU_LEM2E_pme, conjecture, (![X1:a]:(?[X2:a > $o]:((![X3:a, X4:a]:(((((X2 @ (cP @ (cR @ X3) @ (cR @ X4)))&(X2 @ (cP @ (cL @ X3) @ (cL @ X4))))&(((X4)=(cZ))=>((X3)=(cZ))))<=(X2 @ (cP @ X3 @ X4))))&(X2 @ (cP @ cZ @ X1)))))<=(((((((cL @ cZ)=(cZ))&![X1:a]:((((X1)=(cP @ (cL @ X1) @ (cR @ X1)))<=>((X1)!=(cZ)))))&![X2:a > $o]:((![X1:a, X4:a]:(((X2 @ (cP @ X1 @ X4))=>((X1)=(X4))))<=![X1:a, X4:a]:(((X2 @ (cP @ X1 @ X4))=>(((((X1)=(cZ))<=>((X4)=(cZ)))&(X2 @ (cP @ (cR @ X1) @ (cR @ X4))))&(X2 @ (cP @ (cL @ X1) @ (cL @ X4)))))))))&![X5:a, X6:a]:(((cR @ (cP @ X5 @ X6))=(X6))))&![X5:a, X6:a]:(((cL @ (cP @ X5 @ X6))=(X5))))&((cR @ cZ)=(cZ)))), file('/export/starexec/sandbox2/tmp/tmp.eMXRPjAJz6/Vampire---4.8_7759', cPU_LEM2E_pme)). 0.20/0.51 thf(c_0_1, negated_conjecture, ~(((((((((cL @ cZ)=(cZ))&![X1:a]:((((X1)=(cP @ (cL @ X1) @ (cR @ X1)))<=>((X1)!=(cZ)))))&![X2:a > $o]:((![X1:a, X4:a]:(((X2 @ (cP @ X1 @ X4))=>(((((X1)=(cZ))<=>((X4)=(cZ)))&(X2 @ (cP @ (cR @ X1) @ (cR @ X4))))&(X2 @ (cP @ (cL @ X1) @ (cL @ X4))))))=>![X1:a, X4:a]:(((X2 @ (cP @ X1 @ X4))=>((X1)=(X4)))))))&![X5:a, X6:a]:(((cR @ (cP @ X5 @ X6))=(X6))))&![X5:a, X6:a]:(((cL @ (cP @ X5 @ X6))=(X5))))&((cR @ cZ)=(cZ)))=>![X1:a]:(?[X2:a > $o]:((![X3:a, X4:a]:(((X2 @ (cP @ X3 @ X4))=>(((X2 @ (cP @ (cR @ X3) @ (cR @ X4)))&(X2 @ (cP @ (cL @ X3) @ (cL @ X4))))&(((X4)=(cZ))=>((X3)=(cZ))))))&(X2 @ (cP @ cZ @ X1))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cPU_LEM2E_pme])])). 0.20/0.51 thf(c_0_2, negated_conjecture, ![X21:a, X22:a > $o, X25:a, X26:a, X27:a, X28:a, X29:a, X30:a, X32:a > $o]:(((((((((cL @ cZ)=(cZ))&((((X21)!=(cP @ (cL @ X21) @ (cR @ X21)))|((X21)!=(cZ)))&(((X21)=(cZ))|((X21)=(cP @ (cL @ X21) @ (cR @ X21))))))&(((X22 @ (cP @ (esk1_1 @ X22) @ (esk2_1 @ X22)))|(~(X22 @ (cP @ X25 @ X26))|((X25)=(X26))))&((((esk1_1 @ X22)!=(cZ))|((esk2_1 @ X22)!=(cZ))|~(X22 @ (cP @ (cR @ (esk1_1 @ X22)) @ (cR @ (esk2_1 @ X22))))|~(X22 @ (cP @ (cL @ (esk1_1 @ X22)) @ (cL @ (esk2_1 @ X22))))|(~(X22 @ (cP @ X25 @ X26))|((X25)=(X26))))&(((esk1_1 @ X22)=(cZ))|((esk2_1 @ X22)=(cZ))|~(X22 @ (cP @ (cR @ (esk1_1 @ X22)) @ (cR @ (esk2_1 @ X22))))|~(X22 @ (cP @ (cL @ (esk1_1 @ X22)) @ (cL @ (esk2_1 @ X22))))|(~(X22 @ (cP @ X25 @ X26))|((X25)=(X26)))))))&((cR @ (cP @ X27 @ X28))=(X28)))&((cL @ (cP @ X29 @ X30))=(X29)))&((cR @ cZ)=(cZ)))&(((X32 @ (cP @ (esk4_1 @ X32) @ (esk5_1 @ X32)))|~(X32 @ (cP @ cZ @ esk3_0)))&((((esk5_1 @ X32)=(cZ))|(~(X32 @ (cP @ (cR @ (esk4_1 @ X32)) @ (cR @ (esk5_1 @ X32))))|~(X32 @ (cP @ (cL @ (esk4_1 @ X32)) @ (cL @ (esk5_1 @ X32)))))|~(X32 @ (cP @ cZ @ esk3_0)))&(((esk4_1 @ X32)!=(cZ))|(~(X32 @ (cP @ (cR @ (esk4_1 @ X32)) @ (cR @ (esk5_1 @ X32))))|~(X32 @ (cP @ (cL @ (esk4_1 @ X32)) @ (cL @ (esk5_1 @ X32)))))|~(X32 @ (cP @ cZ @ esk3_0))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 0.20/0.51 thf(c_0_3, negated_conjecture, ![X2:a > $o]:(((X2 @ (cP @ (esk4_1 @ X2) @ (esk5_1 @ X2)))|~((X2 @ (cP @ cZ @ esk3_0))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.51 thf(c_0_4, negated_conjecture, ![X35:a > a, X36:a > a]:((((X35 @ (cP @ (esk4_1 @ (^[Z0/* 3 */:a]:(((X35 @ Z0)=(X36 @ Z0))))) @ (esk5_1 @ (^[Z0/* 3 */:a]:(((X35 @ Z0)=(X36 @ Z0)))))))=(X36 @ (cP @ (esk4_1 @ (^[Z0/* 3 */:a]:(((X35 @ Z0)=(X36 @ Z0))))) @ (esk5_1 @ (^[Z0/* 3 */:a]:(((X35 @ Z0)=(X36 @ Z0))))))))|((X35 @ (cP @ cZ @ esk3_0))!=(X36 @ (cP @ cZ @ esk3_0))))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_3])). 0.20/0.51 thf(c_0_5, negated_conjecture, ![X3:a, X1:a]:(((cL @ (cP @ X1 @ X3))=(X1))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.51 thf(c_0_6, negated_conjecture, ![X35:a > a]:((((X35 @ (cP @ (esk4_1 @ (^[Z0/* 3 */:a]:(((X35 @ Z0)=(cL @ Z0))))) @ (esk5_1 @ (^[Z0/* 3 */:a]:(((X35 @ Z0)=(cL @ Z0)))))))=(esk4_1 @ (^[Z0/* 3 */:a]:(((X35 @ Z0)=(cL @ Z0))))))|((X35 @ (cP @ cZ @ esk3_0))!=(cZ)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4, c_0_5]), c_0_5])). 0.20/0.51 thf(c_0_7, negated_conjecture, ![X2:a > $o]:((((esk4_1 @ X2)!=(cZ))|~((X2 @ (cP @ (cR @ (esk4_1 @ X2)) @ (cR @ (esk5_1 @ X2)))))|~((X2 @ (cP @ (cL @ (esk4_1 @ X2)) @ (cL @ (esk5_1 @ X2)))))|~((X2 @ (cP @ cZ @ esk3_0))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.51 thf(c_0_8, negated_conjecture, ((esk4_1 @ (^[Z0/* 3 */:a]:(((cZ)=(cL @ Z0)))))=(cZ)), inference(er,[status(thm)],[c_0_6])). 0.20/0.51 thf(c_0_9, negated_conjecture, ((cR @ cZ)=(cZ)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.51 thf(c_0_10, negated_conjecture, ((cL @ cZ)=(cZ)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.51 thf(c_0_11, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8])]), c_0_9]), c_0_5]), c_0_10]), c_0_5]), c_0_5])]), ['proof']). 0.20/0.51 # SZS output end CNFRefutation 0.20/0.51 # Parsed axioms : 6 0.20/0.51 # Removed by relevancy pruning/SinE : 0 0.20/0.51 # Initial clauses : 17 0.20/0.51 # Removed in clause preprocessing : 5 0.20/0.51 # Initial clauses in saturation : 12 0.20/0.51 # Processed clauses : 37 0.20/0.51 # ...of these trivial : 1 0.20/0.51 # ...subsumed : 1 0.20/0.51 # ...remaining for further processing : 35 0.20/0.51 # Other redundant clauses eliminated : 17 0.20/0.51 # Clauses deleted for lack of memory : 0 0.20/0.51 # Backward-subsumed : 1 0.20/0.51 # Backward-rewritten : 0 0.20/0.51 # Generated clauses : 130 0.20/0.51 # ...of the previous two non-redundant : 93 0.20/0.51 # ...aggressively subsumed : 0 0.20/0.51 # Contextual simplify-reflections : 0 0.20/0.51 # Paramodulations : 76 0.20/0.51 # Factorizations : 10 0.20/0.51 # NegExts : 0 0.20/0.51 # Equation resolutions : 26 0.20/0.51 # Total rewrite steps : 25 0.20/0.51 # Propositional unsat checks : 0 0.20/0.51 # Propositional check models : 0 0.20/0.51 # Propositional check unsatisfiable : 0 0.20/0.51 # Propositional clauses : 0 0.20/0.51 # Propositional clauses after purity: 0 0.20/0.51 # Propositional unsat core size : 0 0.20/0.51 # Propositional preprocessing time : 0.000 0.20/0.51 # Propositional encoding time : 0.000 0.20/0.51 # Propositional solver time : 0.000 0.20/0.51 # Success case prop preproc time : 0.000 0.20/0.51 # Success case prop encoding time : 0.000 0.20/0.51 # Success case prop solver time : 0.000 0.20/0.51 # Current number of processed clauses : 21 0.20/0.51 # Positive orientable unit clauses : 6 0.20/0.51 # Positive unorientable unit clauses: 0 0.20/0.51 # Negative unit clauses : 2 0.20/0.51 # Non-unit-clauses : 13 0.20/0.51 # Current number of unprocessed clauses: 8 0.20/0.51 # ...number of literals in the above : 27 0.20/0.51 # Current number of archived formulas : 0 0.20/0.51 # Current number of archived clauses : 13 0.20/0.51 # Clause-clause subsumption calls (NU) : 31 0.20/0.51 # Rec. Clause-clause subsumption calls : 12 0.20/0.51 # Non-unit clause-clause subsumptions : 2 0.20/0.51 # Unit Clause-clause subsumption calls : 3 0.20/0.51 # Rewrite failures with RHS unbound : 0 0.20/0.51 # BW rewrite match attempts : 0 0.20/0.51 # BW rewrite match successes : 0 0.20/0.51 # Condensation attempts : 0 0.20/0.51 # Condensation successes : 0 0.20/0.51 # Termbank termtop insertions : 11195 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.008 s 0.20/0.51 # System time : 0.004 s 0.20/0.51 # Total time : 0.012 s 0.20/0.51 # Maximum resident set size: 1876 pages 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.008 s 0.20/0.51 # System time : 0.007 s 0.20/0.51 # Total time : 0.015 s 0.20/0.51 # Maximum resident set size: 1724 pages 0.20/0.51 % E---3.1 exiting 0.20/0.51 EOF